Induced restricted Ramsey theorems for spaces
نویسندگان
چکیده
The induced restricted versions of the vector space Ramsey theorem and of the Graham-Rothschild parameter set theorem are proved.
منابع مشابه
Some Developments in Ramsey Theory
Ramsey Theory is a part of combinatorial mathematics that studies the behaviour of structures under partitions. Many Ramsey type results assert that complete disorder is impossible they find some regular substructures in general combinatorial structures. Generic results are due to F.P. Ramsey [R3] and B.L. van der Waerden [V]. The systematic study of these and related statements was initiated b...
متن کاملOn Ramsey-type positional games
Beck introduced the concept of Ramsey games by studying the game versions of Ramsey and van der Waerden theorems. We contribute to this topic by investigating games corresponding to structural extensions of Ramsey and van der Waerden theorems—the theorem of Brauer, structural and restricted Ramsey theorems.
متن کاملTopological Ramsey spaces from Fraïssé classes, Ramsey-classification theorems, and initial structures in the Tukey types of p-points
We present a general method for constructing a new class of topological Ramsey spaces. Members of such spaces are infinite sequences of products of Fräıssé classes of finite relational structures satisfying the Ramsey property. We extend the Product Ramsey Theorem of Sokič to equivalence relations for finite products of structures from Fräıssé classes of finite relational structures satisfying ...
متن کاملParametrizing by the Ellentuck space
We introduce a new construct that can be used to parametrize a topological Ramsey space by the collection of infinite subsets of natural numbers. We show that these parametrized spaces are topological Ramsey spaces. Then we prove a canonical Ramsey theorem for some of the parametrized spaces arising from the construction and conclude with some open questions concerning applications of these can...
متن کاملRamsey-type theorems for metric spaces with applications to online problems
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively studied K-server problem. The proof is based on Ramsey-type theorems for metric spaces, that state that every metric space contains a large subspace which is approximately a hierarchically well-separated tree (and in part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 44 شماره
صفحات -
تاریخ انتشار 1987